A Hybrid Min-min Max-min Algorithm with Improved Performance

The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and MaxMin, to use their cons and at the same time, overcome their pros. This heuristic scheduling algorithm, called min-min min-max selective, is evaluated using a grid simulator called GridSim by comparing to its performance against the two basic heuristics which it comes from. The simulation results show that the new heuristic can lead to significant performance gain for a variety of scenarios.